Greatest Factorial Factorization and Symbolic Summation
نویسنده
چکیده
At present the most general algebraic and algorithmic frame for discussing the problem of indefinite summation is provided by the work of Karr (1981, 1985). His method, working over ΠΣ-fields which are certain difference field extensions of a constant field K, can be viewed as a summation analogue to Risch’s integration method. A difference field simply is a field F together with an automorphism σ of F. Given a, f from a ΠΣ-field F, Karr’s method constructively decides the existence of a solution g ∈ E of σg − a · g = f where E is a fixed ΠΣ-extension field of F; f is called summable (with respect to E) if the equation can be solved in the case a = 1. We distinguish two cases: The “telescoping problem”, i.e., given f ∈ F find g ∈ F such that σg− g = f , and the “general problem”, i.e., given f ∈ F determine a ΠΣ-extension field E of F such that σg − g = f for some g ∈ E. Despite the fact that Karr’s method algorithmically decides whether a proposed extension E is a ΠΣ-extension, the problem with applying Karr’s method for the general case consists in finding an appropriate candidate for E. But in view of his analogue to Liouville’s theorem on elementary integrals (Karr, 1985, RESULT p. 314) one has the following: If f ∈ F is summable in E, then the “interesting” part of it already is summable in F, and the remainder consists of formal sums that have been adjoined to F in the construction of E. This justifies to consider the telescoping problem separately. Pointing to rational and hypergeometric summation techniques which do not require complete factorization, Karr (1981, sect. 4.2) raises the question whether similar techniques can be “profitably applied” in his ΠΣ-field theory. Despite the fact that the present
منابع مشابه
A Generalization of Gosper's Algorithm to Bibasic Hypergeometric Summation
An algebraically motivated generalization of Gosper’s algorithm to indefinite bibasic hypergeometric summation is presented. In particular, it is shown how Paule’s concept of greatest factorial factorization of polynomials can be extended to the bibasic case. It turns out that most of the bibasic hypergeometric summation identities from literature can be proved and even found this way. A Mathem...
متن کاملMultibasic and Mixed Hypergeometric Gosper-Type Algorithms
Gosper’s summation algorithm finds a hypergeometric closed form of an indefinite sum of hypergeometric terms, if such a closed form exists. We extend his algorithm to the case when the terms are simultaneously hypergeometric and multibasic hypergeometric. We also provide algorithms for finding polynomial as well as hypergeometric solutions of recurrences in the mixed case. We do not require the...
متن کاملA Mathematica q - Analogue
Mathematica implementations, available by email request, of q-analogues of Gosper's and Zeilberger's algorithm are described. Nontrivial examples are given in order to illustrate the usage of these packages. The algorithms are based on a new approach to q-hypergeometric telescoping in which a new algebraic concept, q-greatest factorial factorization (qGFF), plays a fundamental role.
متن کاملA Mathematica q-Analogue of Zeilberger’s Algorithm Based on an Algebraically Motivated Approach to q-Hypergeometric Telescoping
Mathematica implementations, available by email request, of q-analogues of Gosper’s and Zeilberger’s algorithm are described. Nontrivial examples are given in order to illustrate the usage of these packages. The algorithms are based on a new approach to q-hypergeometric telescoping in which a new algebraic concept, q-greatest factorial factorization (qGFF), plays a fundamental role.
متن کاملABC: Algebraic Bound Computation for Loops
We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis of programs with symbolic summation techniques to derive loop invariant relations between program variables. Iteration bounds are obtained from the inferred invariants, by replacing variables with bounds on their greatest valu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 20 شماره
صفحات -
تاریخ انتشار 1995